Attribute-Based Encryption for Finite Automata from LWE
نویسندگان
چکیده
منابع مشابه
Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
In this paper, we revisit fully homomorphic encryption (FHE) based on GSW and its ring variants. We notice that the internal product of GSW can be replaced by a simpler external product between a GSW and an LWE ciphertext. We show that the bootstrapping scheme FHEW of Ducas and Micciancio [14] can be expressed only in terms of this external product. As a result, we obtain a speed up from less t...
متن کاملAdaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
In this paper, we present two new adaptively secure identity-based encryption (IBE) schemes from lattices. The size of the public parameters, ciphertexts, and private keys are Õ(nκ), Õ(n), and Õ(n) respectively. Here, n is the security parameter, κ is the length of the identity, and d ∈ N is a flexible constant that can be set arbitrary (but will affect the reduction cost). Ignoring the poly-lo...
متن کاملDeniable Attribute Based Encryption for Branching Programs from LWE
Deniable encryption (Canetti et al. CRYPTO ’97) is an intriguing primitive that provides a security guarantee against not only eavesdropping attacks as required by semantic security, but also stronger coercion attacks performed after the fact. The concept of deniability has later demonstrated useful and powerful in many other contexts, such as leakage resilience, adaptive security of protocols,...
متن کاملHomomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
We describe a comparatively simple fully homomorphic encryption (FHE) scheme based on the learning with errors (LWE) problem. In previous LWE-based FHE schemes, multiplication is a complicated and expensive step involving “relinearization”. In this work, we propose a new technique for building FHE schemes that we call the approximate eigenvector method. In our scheme, for the most part, homomor...
متن کاملAttribute-based fully homomorphic encryption with a bounded number of inputs
The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE) is through indistinguishability obfsucation. The best we can do at the moment without obfuscation is Attribute-Based Leveled FHE which allows circuits of an a priori bounded depth to be evaluated. This has been achieved from the Learning with Errors (LWE) assumption. However we know of no other way without obfusc...
متن کامل